A linear time algorithm for monadic querying of indefinite data over linearly ordered domains

نویسنده

  • Mizuhito Ogawa
چکیده

Temporal databases, databases of events in an ordered domain, have attracted attention since the early 90’s, and the complexity of evaluating various queries on such databases has been analyzed [1, 10]. One important issue is an efficient algorithm for a query on an indefinite data over a linearly ordered domain, i.e., efficiently answering a query as to whether all possible models of incomplete (partial) information satisfy it. Ref. [20] gives the nice overview of the applications. In general, query answering on an indefinite database is a hard problem by any measure: combined complexity, expression complexity, and data complexity [21]. Combined complexity is complexity in the usual sense, expression complexity is the complexity when the database is fixed, and data complexity is the complexity when the query is fixed. The complexity of query answering using a search engine on the Web would be measured using expression complexity, and the complexity of finding the best-fit gene to several characteristic alignments would be measured using data complexity. Van der Meyden estimated the precise complexity of query answering on an indefinite database, as illustrated in Table 1 [20]. The table includes the answer to an open problem that the combined complexity of evaluating a conjunctive (n-ary) query containing inequalities is Πp2-complete [9]. He also investigated tractable subclasses and demonstrated that the restriction to monadic queries on monadic indefinite databases reduces the complexity drastically, as shown in Table 2. While the class of monadic queries is restrictive, still contains nontrivial problems, such as a comparison between two gene alignments (assuming C,G,A, and T to be monadic predicates).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Time Algorithm Generation based on Well-Quasi-Orders

This paper demonstrates an automatic linear time generation based on the constructive proof of Higman's lemma described by Murthy-Russell (IEEE LICS 1990). A linear time disjunctive monadic query processing in an inde nite database on a linearly ordered domain, rst posed by Van der Meyden (ACM PODS 1992), is used as an example. Van der Meyden showed the existence of a linear time algorithm, but...

متن کامل

On residuated lattices with universal quantifiers

We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

متن کامل

Automata based verification over linearly ordered data domains

In this paper we work over linearly ordered data domains equipped with finitely many unary predicates and constants. We consider nondeterministic automata processing words and storing finitely many variables ranging over the domain. During a transition, these automata can compare the data values of the current configuration with those of the previous configuration using the linear order, the un...

متن کامل

Composition Theorems for Generalized Sum and Recursively Defined Types

Composition theorems are tools which reduce reasoning about compound data structures to reasoning about their parts. For example, the truth value of a sentence about the Cartesian product of two structures can be reduced to the truth values of sentences on the components of the product. A seminal example of a compositional theorem is the Feferman-Vaught Theorem [2]. Feferman and Vaught introduc...

متن کامل

Topology in Zfc*

The first-order theory of linear order is far from trivia!. The monadic (secondorder) theory of linear order is much stronger. Stil~ surpr,Mng decidability results were proven in that direction. Rabin proved in [10i that the monadic theory of the rational chain is decidable. Hence the monadic theory of all countable linear orders is decidable. Biichi proved in [I] that the monadic theory of ord...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 186  شماره 

صفحات  -

تاریخ انتشار 2003